Dynamic Generation and Prefetching of Data Tiles for Exploratory Visualization Anonymous Abstract— With many current visualization systems, users must manually throw data away until it fits in memory, before they can v

Source URL: www.cs.tufts.edu

Using  Escape  Analysis  in  Dynamic  Data  Race  Detec3on   Emma  Harrington  `15   Williams  College       How  common  are  local  accesses?

Source URL: dept.cs.williams.edu

• Concurrency control
• Software design patterns
• Concurrent computing
• Inter-process communication
• Lock
• Futures and promises
• Thread

Proceedings of the 2015 Winter Simulation Conference L. Yilmaz, W. K V. Chan, I. Moon, T. M. K. Roeder, C. Macal, and M. Rosetti, eds. DATA-DRIVEN DYNAMIC DECISION MODELS John J. Nay

Source URL: my.vanderbilt.edu

Appears in Proceedings of the 11th IEEE International Conference on Network Protocols (ICNPExploiting Routing Redundancy via Structured Peer-to-Peer Overlays Ben Y. Zhao, Ling Huang, Jeremy Stribling, Anthony D.

Source URL: www.cs.ucsb.edu

• Distributed data storage
• Tapestry
• Routing
• Overlay network
• Pastry
• Dynamic routing
• Peer-to-peer
• Chord
• Distributed hash table
• Content addressable network

Memory-safe Execution of C on a Java VM Matthias Grimmer Roland Schatz Chris Seaton

Source URL: chrisseaton.com

• Software engineering
• Computing
• Computer programming
• Data types
• C++
• Memory management
• Primitive types
• Software bugs
• Pointer
• Struct
• Memory safety
• C dynamic memory allocation

A General Approach for Efficiently Accelerating Software-based Dynamic Data Flow Tracking on Commodity Hardware Kangkook Jee1 , Georgios Portokalidis1 , Vasileios P. Kemerlis1 , Soumyadeep Ghosh2 , David I. August2 , and

Source URL: www.cs.stevens.edu

MG++: Memory Graphs for Analyzing Dynamic Data Structures Vineet Singh Rajiv Gupta

Source URL: www.cs.ucr.edu

UNEDITED PREPRINT Building a dynamic growth model for trembling aspen in Western Canada without age data Oscar Garc´ıa Abstract:

Source URL: forestgrowth.unbc.ca

Frameworks for massively parallel computing: Massively inefficient? Bianca Schroeder* (joint with Nosayba El-Sayed) University of Toronto

Source URL: tce.technion.ac.il

• Computer memory
• Parallel computing
• Data quality
• Fault-tolerant computer systems
• Apache Hadoop
• Apache Software Foundation
• Dynamic random-access memory
• Data corruption
• Soft error
• Hard disk drive
• Computer cluster
• DIMM

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0–0 (0) DOI: Interactive Visualization of Streaming Text Data with Dynamic Maps

Source URL: yifanhu.net